Convex Relaxation for Grain Segmentation at Atomic Scale
نویسندگان
چکیده
Grains are material regions with different lattice orientation at atomic scale. They can be resolved on material surfaces with recent image acquisition technology. Simultaneously, new microscopic simulation tools allow to study mechanical models of grain structures. The robust and reliable identification and visualization of grain boundaries in images both from simulation and from experiments is of central importance in the field of material surface analysis. In this work, we compare a variety of variational approaches for grain boundary estimation from microscopy and simulation images. In particular, we show that grain boundary estimation can be solved by means of recently introduced convex relaxation techniques. These techniques allow to compute global solutions or solutions within a known bound of the optimum. Moreover, experimental results both on simulated and on transmission electron microscopy images confirm that the convex relaxation techniques provide significant improvements of the estimated grain boundaries over previously employed multiphase level set formulations.
منابع مشابه
Convex Relaxation Techniques for Segmentation, Stereo and Multiview Reconstruction
1 Convex Relaxation Techniques for Segmentation, Stereo and Multiview Reconstruction 2 1.1 Variational Methods, Partial Differential Equations and Convexity 2 1.2 Image Segmentation and Minimal Partitions 4 1.2.1 Classical Variational Approaches 4 1.2.2 A General Variational Formulation 5 1.2.3 Convex Representation 6 1.2.4 Convex Relaxation 8 1.2.5 Experimental Segmentation Results 9 1.3 Stere...
متن کاملScale-Aware Object Tracking with Convex Shape Constraints on RGB-D Images
Convex relaxation techniques have become a popular approach to a variety of image segmentation problems as they allow to compute solutions independent of the initialization. In this paper, we propose a novel technique for the segmentation of RGB-D images using convex function optimization. The function that we propose to minimize considers both the color image and the depth map for finding the ...
متن کاملSparse Template-Based variational Image Segmentation
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves robustness by tolerating overlapping templates with a regularizer enforcing sparsity. A suitable convex relaxation leads to the variational approach that is amenable to large-scale convex programming. Our approach take...
متن کاملPlasticity of nanocrystalline alloys with chemical order: on the strength and ductility of nanocrystalline Ni–Fe
Plastic deformation and alloying of nanocrystalline Ni-Fe is studied by means of atomic scale computer simulations. By using a combination of Monte-Carlo and molecular dynamics methods we find that solutes have an ordering tendency even if grain sizes are in the nanometer regime, where the phase field of the ordered state is widened as compared to larger grain sizes. Tensile testing of disorder...
متن کاملConvex Relaxation for Multilabel Problems with Product Label Spaces
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements scale linearly in the total number of labels, making them very inefficient and often unapplicable for problems with higher dimensional label spaces. In this paper, we propose a reduction technique for the case that the lab...
متن کامل